WORST_CASE(?,O(n^2))

Solution:
---------

  "0" :: [] -(0)-> "A"(0, 0)
  "0" :: [] -(0)-> "A"(1, 0)
  "0" :: [] -(0)-> "A"(6, 5)
  "false" :: [] -(0)-> "A"(0, 0)
  "if_mod" :: ["A"(0, 0) x "A"(5, 5) x "A"(0, 0)] -(0)-> "A"(0, 0)
  "le" :: ["A"(0, 0) x "A"(1, 0)] -(1)-> "A"(0, 0)
  "minus" :: ["A"(8, 5) x "A"(0, 0)] -(1)-> "A"(8, 5)
  "mod" :: ["A"(6, 5) x "A"(0, 0)] -(1)-> "A"(0, 0)
  "s" :: ["A"(0, 0)] -(0)-> "A"(0, 0)
  "s" :: ["A"(1, 0)] -(1)-> "A"(1, 0)
  "s" :: ["A"(13, 5)] -(8)-> "A"(8, 5)
  "s" :: ["A"(11, 5)] -(6)-> "A"(6, 5)
  "s" :: ["A"(10, 5)] -(5)-> "A"(5, 5)
  "true" :: [] -(0)-> "A"(0, 0)


Cost Free Signatures:
---------------------

  "0" :: [] -(0)-> "A"_cf(0, 0)
  "0" :: [] -(0)-> "A"_cf(2, 0)
  "0" :: [] -(0)-> "A"_cf(1, 1)
  "false" :: [] -(0)-> "A"_cf(0, 0)
  "false" :: [] -(0)-> "A"_cf(1, 1)
  "if_mod" :: ["A"_cf(0, 0) x "A"_cf(0, 0) x "A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "if_mod" :: ["A"_cf(1, 1) x "A"_cf(2, 0) x "A"_cf(0, 0)] -(1)-> "A"_cf(1, 0)
  "le" :: ["A"_cf(0, 0) x "A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "le" :: ["A"_cf(0, 0) x "A"_cf(0, 0)] -(1)-> "A"_cf(1, 1)
  "minus" :: ["A"_cf(5, 0) x "A"_cf(0, 0)] -(1)-> "A"_cf(0, 0)
  "minus" :: ["A"_cf(0, 0) x "A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "minus" :: ["A"_cf(2, 0) x "A"_cf(0, 0)] -(1)-> "A"_cf(2, 0)
  "mod" :: ["A"_cf(0, 0) x "A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "mod" :: ["A"_cf(2, 0) x "A"_cf(0, 0)] -(2)-> "A"_cf(1, 0)
  "s" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "s" :: ["A"_cf(5, 0)] -(5)-> "A"_cf(5, 0)
  "s" :: ["A"_cf(2, 0)] -(2)-> "A"_cf(2, 0)
  "true" :: [] -(0)-> "A"_cf(0, 0)
  "true" :: [] -(0)-> "A"_cf(1, 1)


Base Constructors:
------------------